On the Error-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
نویسندگان
چکیده
Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing the single parity-check constituent codes in Gallager’s LDPC codes with Hamming codes. This paper investigates the asymptotic performance of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. It is shown that there exist H-LDPC codes for which such iterative decoding corrects any error pattern with a number of errors that grows linearly with the code length. The number of required decoding iterations is a logarithmic function of the code length. The fraction of correctable errors is computed numerically for different code parameters.
منابع مشابه
On the erasure-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes
Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algori...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملIterative Channel Decoding of FEC-Based Multiple Descriptions using LDPC-RS Product Codes
Product code has been proposed as a promising technique for cloud transmission of multimedia information, because of its superior error correcting capabilities. In this paper we study product code based on a vertical low-density parity check (LDPC) code and horizontal Reed-Solomon (RS) code for transmission of progressively coded image and propose an iterative decoding algorithm. The transmitte...
متن کاملDNA Barcoding through Quaternary LDPC Codes
For many parallel applications of Next-Generation Sequencing (NGS) technologies short barcodes able to accurately multiplex a large number of samples are demanded. To address these competitive requirements, the use of error-correcting codes is advised. Current barcoding systems are mostly built from short random error-correcting codes, a feature that strongly limits their multiplexing accuracy ...
متن کامل